Coding of correlated sources with prescribed distortion by separated encoders
نویسندگان
چکیده
منابع مشابه
The Multiple Access Channel with Correlated Sources and Cribbing Encoders
A discrete memoryless multiple access channel (MAC) is a quadruple { X1,X2, PY |X1,X2 ,Y } where X1,X2 are the input alphabets, Y the output alphabet, and PY |X1,X2 a transition probability matrix from X1 × X2 to Y . For shorthand notation, we will refer to the MAC by PY |X1,X2 . A source pair is a triplet {U ,V, PU,V } where PU,V is a distribution on U × V . We use the following notation: rand...
متن کاملUniversal Coding for Correlated Sources with Memory
|Universal coding problem for the system of Slepian and Wolf (the SW-system) has rst been investigated by Csisz ar and Korner. They considered the correlated memoryless sources, and established a universally attainable error exponent as a function of rate pair (R1;R2) that is positive whenever (R1; R2) is an inner point of the admissible rate region of the SW-system, which is speci ed dependin...
متن کاملNetwork Coding for Correlated Sources
We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required. We give, for two arbitrarily correlated sources in a general network, upper bounds on the probability of decoding error at each receiver, in terms of network parameters. In the special case of a Slepian-Wolf sour...
متن کاملRate-Distortion Auto-Encoders
A rekindled the interest in auto-encoder algorithms has been spurred by recent work on deep learning. Current efforts have been directed towards effective training of auto-encoder architectures with a large number of coding units. Here, we propose a learning algorithm for auto-encoders based on a rate-distortion objective that minimizes the mutual information between the inputs and the outputs ...
متن کاملOn zero-error coding of correlated sources
The problem of separate zero-error coding of correlated sources is considered. Inner and outer single-letter bounds are established for the achievable rate region, and conditions for their coincidence are investigated. It is shown that successive encoding combined with time sharing is not always an optimal coding strategy. Conditions for its optimality are derived. The inner bound to the achiev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1980
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.77.10.5618